Identifying buildings in aerial images using constraint relaxation and variable elimination
نویسندگان
چکیده
منابع مشابه
Identifying Buildings in Aerial Images Using Constraint Relaxation and Variable Elimination
THIS ARTICLE DESCRIBES AN APplication of constraint logic programming that comes from the research field of object recognition: the identification of buildings in aerial images. 3D building extraction is needed for an increasing number of tasks related to measurement, planning, construction, environment, transportation, energy, and property management. Semiautomatic photogrammetric tools are we...
متن کاملDetecting buildings in aerial images
Detecting building structures in aerial images is a task of importance for many applications. Low-level segmentation rarely gives a complete outline of the desired structures. We use a generic model of the shapes of the structures we are looking for-that they are rectangular or composed of rectangular components. We also use shadows cast by buildings to con&m their presence and to estimate thei...
متن کاملUsing Constraints for the Identiication of Buildings in Aerial Images
Aerial images constitute an important data source for Geo-Information Systems. In order to get actual data at reasonable costs, the development of (semi-)automatic tools has been an active research topic in photogrammetry and image processing in the recent years. Based on established techniques for low level syntactic operators such as lters, feature extraction, line detectors and simple patter...
متن کاملAutomatic Classification of Collapsed Buildings using Stereo Aerial Images
After an earthquake, the image-based interpretation methods are powerful tools for detection and classification of damaged buildings. A method based on two kinds of image-extracted features comparing stereo pairs of aerial images before and after an earthquake is presented. Comparing preand post event DSMs generated from stereo images could be a solution for detecting the extent of demolished a...
متن کاملVariable Independence , Quanti er Elimination , and Constraint
Whenever we have data represented by constraints (such as order, linear, polynomial, etc.), running time for many constraint processing algorithms can be considerably lowered if it is known that certain variables in those constraints are independent of each other. For example, when one deals with spatial and temporal databases given by constraints, the projection operation, which corresponds to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Intelligent Systems
سال: 2000
ISSN: 1094-7167
DOI: 10.1109/5254.820327